On the Proper Characterization of ‘Nonconcatenative’ Languages
نویسندگان
چکیده
Nonconcatenative languages have been claimed to employ a special type of phonological spreading of a consonant over a vowel, which assumes a representation that segregates consonants and vowels on different planes. I argue that this type of spreading can and must be eliminated from the theory, by reducing it to segmental copying as in reduplication. Crucial to this reduction is the notion of gradient violation of constraints in Optimality Theory (Prince & Smolensky 1993), and the notion of Correspondence with its particular application to reduplicative morphology (McCarthy & Prince 1995a). The reduction is demonstrated in detail for Temiar, one of the main indigenous languages of Malaysia, notorious for the complexity of its copying patterns. Extensions of the proposal to Semitic languages are also discussed. Two main theoretical implications of this reduction are then developed. First, the distinction between concatenative and nonconcatenative languages need not and should not be encoded in terms of the special phonological mechanisms of consonantal spreading over a vowel, applying under planar segregation. Second, the locus of the distinction is found to be, instead, in the mode of affixation employed in nonconcatenative languages, namely, a-templatic reduplicative affixation. This type of affixation is predicted, though heretofore undocumented in the typology of word formation.
منابع مشابه
Constraints on two types of nonconcatenative morphology in signed languages
Signed languages strongly favor nonconcatenative morphology (Aronoff, Meir and Sandler 2005, Fernald and Napoli 2000). This type of morphology includes processes that change at least one of the parameters of the stem, such as handshape, orientation, location or movement. It is argued that there are two types of nonconcatenative morphology in signed languages. In one type, exemplified by numeral...
متن کاملKnow When to Hold 'Em: Shu ing Deterministically in a Parser for Nonconcatenative Grammars
Nonconcatenative constraints, such as the shuue relation , are frequently employed in grammatical analyses of languages that have more exible ordering of constituents than English. We show how it is possible to avoid searching the large space of permutations that results from a nondeterministic application of shuue constraints. The results of our implementation demonstrate that deterministic ap...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملKnow When to Hold 'Em: Shuffling Deterministically in a Parser for Nonconcatenative Grammars
Nonconcatenative constraints, such as the shuffle relation, are frequently employed in grammatical analyses of languages that have more flexible ordering of constituents than English. We show how it is possible to avoid searching the large space of permutations that results from a nondeterministic application of shuffle constraints. The results of our implementation demonstrate that determinist...
متن کاملApplication of Proper Nouns as Terms of Address in Russian Compared to their Persian Equivalents
This study delved into the application of proper nouns as terms of address in Russian and Persian. In other words, it examined the rules governing the application of terms of address expressed as the names of individuals in different speech situations in both languages. The comparative study of the cultural features of languages spoken by Russians and Iranians called for the investigation of th...
متن کامل